Coalition convex preference orders are almost surely convex

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Increasing Convex and Directionally Convex Orders

In this paper, the componentwise increasing convex order, the upper orthant order, the upper orthant convex order, and the increasing directionally convex order for random vectors are generalized to hierarchical classes of integral stochastic order relations. The elements of the generating classes of functions possess nonnegative partial derivatives up to some given degrees. Some properties of ...

متن کامل

When Structures Are Almost Surely Connected

Let An denote the number of objects of some type of “size” n, and let Cn denote the number of these objects which are connected. It is often the case that there is a relation between a generating function of the Cn’s and a generating function of the An’s. Wright showed that if limn→∞Cn/An = 1, then the radius of convergence of these generating functions must be zero. In this paper we prove that...

متن کامل

Solvable Baumslag-solitar Groups Are Not Almost Convex

The arguments of Cannon, Floyd, Grayson and Thurston [CFGT] showing that solvegeometry groups are not almost convex apply to solvable Baumslag-Solitar groups.

متن کامل

Stationary-excess operator and convex stochastic orders

The present paper aims to point out how the stationary-excess operator and its iterates transform the s-convex stochastic orders and the associated moment spaces. This allows us to propose a new unified method on constructing s-convex extrema for distributions that are known to be t-monotone. Both discrete and continuous cases are investigated. Several extremal distributions under monotonicity ...

متن کامل

Almost Convex Functions: Conjugacy and Duality

We prove that the formulae of the conjugates of the precomposition with a linear operator, of the sum of finitely many functions and of the sum between a function and the precomposition of another one with a linear operator hold even when the convexity assumptions are replaced by almost convexity or nearly convexity. We also show that the duality statements due to Fenchel hold when the function...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1986

ISSN: 0022-247X

DOI: 10.1016/0022-247x(86)90106-x